Towards Automatic Analysis of Election Verifiability Properties
نویسندگان
چکیده
We present a symbolic definition that captures some cases of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the software tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifiability. We demonstrate the applicability of our formalism by analysing the protocols due to Fujioka, Okamoto & Ohta and a variant of the one by Juels, Catalano & Jakobsson (implemented as Civitas by Clarkson, Chong & Myers).
منابع مشابه
Privacy and verifiability in electronic voting
Privacy and verifiability refer to fundamental principles of democratic elections and therefore belong to the set of established security requirements which each electronic voting scheme is expected to meet. However, very different ideas and opinions about privacy and verifiability exist in the scientific community, which shows that both properties are not well understood yet. Moreover, althoug...
متن کاملVerifiability in Electronic Voting - Explanations for Non Security Experts
Scientists have requested verifiable electronic voting schemes for many years. These schemes offer individual and universal verifiability by applying and combining complex cryptographic primitives and protocols. Electronic voting systems in use provide less or even no verifiability. Thus election authorities and voters need to trust the provider and developer of the voting system regarding the ...
متن کاملVerification and Validation Issues in Electronic Voting
Electronic democracy (e-democracy) is a necessity in this era of computers and information technology. Electronic election (e-election) is one of the most important applications of e-democracy, because of the importance of the voters’ privacy and the possibility of frauds. Electronic voting (e-voting) is the most significant part of e-election, which refers to the use of computers or computeris...
متن کاملElection Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ
Election verifiability is defined in the computational model of cryptography. The definition formalizes notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009), Helios-C (Cortier et al., 2014) and JCJ (Juels et al., 2010) election schemes are analyzed using the definition. Neither ...
متن کاملElection Verifiability: Cryptographic Definitions and an Analysis of Helios, Helios-C, and JCJ
Election verifiability is defined in the computational model of cryptography. The definition formalizes notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009), Helios-C (Cortier et al., 2014) and JCJ (Juels et al., 2010) election schemes are analyzed using the definition. Neither ...
متن کامل